Dictionary Grammars
نویسندگان
چکیده
منابع مشابه
Dictionaries, Dictionary Grammars and Dictionary Entry Parsing
We identify two complementary p.ro.cesses in. the conversion of machine-readable dmUonanes into lexical databases: recovery of the dictionary structure from the typographical markings which persist on the dictionary distribution tapes and embody the publishers' notational conventions; followed by making explicit all of the codified and ellided information packed into individual entries. We disc...
متن کاملTree Grammars (Grammars)
i. This paper suggests a new kind of formal grammar (hereafter called A-grammarS) which in some respects is closely related to Chomsky's grammars but differs from these in that it is meant to process trees (in the sense of graph theory) and not to process strings as Chomsky's grammars do. More precisely, we aim at a type of grammar with rewriting rules of the'X ~Y" where X and Y are trees (N.B....
متن کاملInteraction Grammars Interaction Grammars
Interaction Grammar (IG) is a grammatical formalism based on the notion of polarity. Polarities express the resource sensitivity of natural languages by modelling the distinction between saturated and unsaturated syntactic structures. Syntactic composition is represented as a chemical reaction guided by the saturation of polarities. It is expressed in a model-theoretic framework where grammars ...
متن کاملLambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars
Two recent extension of the nonassociative Lambek calculus, the LambekGrishin calculus and the multimodal Lambek calculus, are shown to generate class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.
متن کاملExtending Lambek Grammars to Basic Categorial Grammars
Pentus [24] proves the equivalence of LCG’s and CFG’s, and CFG’s are equivalent to BCG’s by the Gaifman theorem [1]. This paper provides a procedure to extend any LCG to an equivalent BCG by affixing new types to the lexicon; a procedure of that kind was proposed as early, as Cohen [12], but it was deficient [4]. We use a modification of Pentus’ proof and a new proof of the Gaifman theorem on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: HERMES - Journal of Language and Communication in Business
سال: 2017
ISSN: 1903-1785,0904-1699
DOI: 10.7146/hjlcb.v20i38.25908